package Recursion;

import java.util.Scanner;
public class Fibonacci {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        ff my=new ff();
        System.out.println( my.Fibonacci1(n));
    }
}

class ff{
    public int Fibonacci1(int n){
        if(n==1 || n==2){
            return 1;
        }
        else return Fibonacci1(n-1) + Fibonacci1(n-2);
    }
}
